منابع مشابه
Asymptotics of Bayesian median loss estimation
We establish the consistency, asymptotic normality, and efficiency for estimators derived by minimizing the median of a loss function in a Bayesian context. We contrast this procedure with the behavior of two Frequentist procedures, the least median of squares (LMS) and the least trimmed squares (LTS) estimators, in regression problems. The LMS estimator is the Frequentist version of our estima...
متن کاملHigher order asymptotics for the MSE of the median on shrinking neighborhoods
Infinitesimal robustness employs first order asymptotics to derive results on uniform (weak) convergence on shrinking neighborhoods around an ideal central model. In the case of the median in the one–dimensional location setup, we refine such a result concerning the convergence of the MSE, proceeding to higher order asymptotics — up to order 1/n , for sample size n . In contrast to usual higher...
متن کاملthe search for the self in becketts theatre: waiting for godot and endgame
this thesis is based upon the works of samuel beckett. one of the greatest writers of contemporary literature. here, i have tried to focus on one of the main themes in becketts works: the search for the real "me" or the real self, which is not only a problem to be solved for beckett man but also for each of us. i have tried to show becketts techniques in approaching this unattainable goal, base...
15 صفحه اولABCDepth: efficient algorithm for Tukey depth
We present a new algorithm for Tukey (halfspace) depth level sets and its implementation. Given d-dimensional data set for any d ≥ 2, the algorithm is based on representation of level sets as intersections of balls in R, and can be easily adapted to related depths (Type D, Zuo and Serfling (Ann. Stat. 28 (2000), 461–482)). The algorithm complexity is O(dn + n log n) where n is the data set size...
متن کاملthe algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Multivariate Analysis
سال: 2002
ISSN: 0047-259X
DOI: 10.1006/jmva.2001.2008